Dietzfelbinger, M.; Hromkovič, J.; Schnitger, G. (1996), “A comparison of two lower-bound methods for communication complexity”, Theoret. Comput. Sci. 168 (1): 39–51
Raz, Ran (2004), “Circuit and Communication Complexity”, trong Rudich, Steven; Wigderson, Avi, Computational Complexity Theory, American Mathematical Society Institute for Advanced Study, tr. 129–137
Yao, A. C. (1979), “Some Complexity Questions Related to Distributed Computing”, Proc. of 11th STOC, tr. 209–213
Newman, I. (1991), “Private vs. Common Random Bits in Communication Complexity”, Information Processing Letters 39: 67–71
